Timed Automata Approach for the Axxom Case Study Scheduling a Lacquer Production

This report presents our first experiments with the AXXOM case study proposed in AMETIST. The production plan has been entirely modeled as a network of timed automata and the scheduling problem has been therefore reduced to a minimal cost path extraction problem. The minimal cost path problem has been solved successfully for the 29 lacquers defined in the case study. Several heuristics have been applied in order to reduce the search space, while preserving the optimal solution. We found that feasible schedules (0 delay paths) exists and construct them automatically from our model.